A Problem of Nding an Acceptable Variant in Some Generalized Project Networks
نویسندگان
چکیده
A project network often has some activities or groups of activities which can be performed at diierent stages of the project. Then, the problem of nding an optimal time or/and optimal order of such an activity or a group of activities arises. Such problems emerge, in particular, in house-building management when the beginnings of some activities may vary in time or/and order. We consider a mathematical formulation of the problem, show its computational complexity and describe an algorithm for solving the problem.
منابع مشابه
A problem of finding an acceptable variant in generalized project networks
A project network often has some activities or groups of activities which can be performed at different stages of the project. Then, the problem of finding an optimal/acceptable time or/and optimal/acceptable order of such an activity or a group of activities arises. Such a problem emerges, in particular, in house-building management when the beginnings of some activities may vary in time or/an...
متن کاملAn Exact Algorithm for the Mode Identity Project Scheduling Problem
In this paper we consider the non-preemptive variant of a multi-mode resource constrained project scheduling problem (MRCPSP) with mode identity, in which a set of project activities is partitioned into disjoint subsets while all activities forming one subset have to be processed in the same mode. We present a depth-first branch and bound algorithm for the resource constrained project schedulin...
متن کاملEnhanced ACS algorithms for plastic analysis of planar frames
In recent years, the trend in solving optimization problems has been directed toward using heuristic algorithms such as neural networks, genetic and ant colony algorithms. The main reason for this trend can be attributed to the fact that these algorithms can be efficiently adjusted to the specific search space to which they are applied and consequently they can be used for many optimization pro...
متن کاملApproximating fixed points for nonexpansive mappings and generalized mixed equilibrium problems in Banach spaces
We introduce a new iterative scheme for nding a common elementof the solutions set of a generalized mixed equilibrium problem and the xedpoints set of an innitely countable family of nonexpansive mappings in a Banachspace setting. Strong convergence theorems of the proposed iterative scheme arealso established by the generalized projection method. Our results generalize thecorresponding results...
متن کاملAn Optimization Model for Epidemic Mitigation and Some Theoretical and Applied Generalizations
In this paper, we present a binary-linear optimization model to prevent the spread of an infectious disease in a community. The model is based on the remotion of some connections in a contact network in order to separate infected nodes from the others. By using this model we nd an exact optimal solution and determine not only the minimum number of deleted links but also their exact positions. T...
متن کامل